Lecture 6 : Frequency Moment Approximation
نویسنده
چکیده
F2 is particularly interesting and useful to approximate. One reason that we might be interested is in understanding the quality of the output of the COUNT Sketch approximation, where |f̃j − fj| ≤ ε||f−j||2 ≤ ε √ F2. Since F1 is easy to compute exactly, the errors in the COUNT-MIN and MisraGries estimates are easy to compute. The F2 approximation lets us get good estimates of the (smaller) error for the COUNT Sketch also.
منابع مشابه
Calculation of the Induced Charge Distribution on the Surface of a Metallic Nanoparticle Due to an Oscillating Dipole Using Discrete Dipole Approximation method
In this paper, the interaction between an oscillating dipole moment and a Silver nanoparticle has been studied. Our calculations are based on Mie scattering theory and discrete dipole approximation(DDA) method.At first, the resonance frequency due to excitingthe localized surface plasmons has been obtained using Mie scattering theory and then by exciting a dipole moment in theclose proximity of...
متن کاملTime-Dependent Statistical Mechanics 14. Electromagnetic absorption by dilute gases
When the electromagnetic field couples to the electric dipole moment of the Continuation of lecture 13 11/5/09 region under consideration, we see that the absorption spectrum, except for simple frequency-dependent factors, is proportional to the Fourier transform of the correlation function of the dipole moment. Using the methods we have been discussing, that correlation function can be written as
متن کاملFlood Flow Frequency Model Selection Using L-moment Method in Arid and Semi Arid Regions of Iran
Statistical frequency analysis is the most common procedure for the analysis of flood data at a gauged location thatin first step it is needed to select a model to represent the population. Among them, the central moment has been themost common and widely used, and with the using of computers, the application of the maximum likelihood hasincreased. This research was carried out in order to reco...
متن کامل236779 : Foundations of Algorithms for Massive Datasets Nov 11 2015 Lecture
These notes cover the end of the Frequent-items (Batch-Decrement) sketch, the Count-Min sketch, the F2 Tug-of-War sketch (AMS), and initial background for dimensionality reduction and the Johnson-Lindenstrauss transform. 1 Reminder: Frequency Moments We are given a stream (sequence) of N characters (or items) a1, a2, . . . , aN from a large alphabet Σ of size |Σ| = n. Definition 1. A histogram ...
متن کاملLecture 6 & 7 : O ( log ( n ) / log log ( n ) ) Approximation Algorithms for ATSP
In the next few lectures we will talk about three new variants of the classical randomized rounding technique, namely the rounding by sampling method, the pipage rounding method and the iterative rounding method. We will use these techniques to design approximation algorithms for Asymmetric TSP (ATSP) and the Steiner tree problems. The materials of the this lecture are based on the works of Asa...
متن کاملذخیره در منابع من
با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید
عنوان ژورنال:
دوره شماره
صفحات -
تاریخ انتشار 2014